Connectivity of random regular graphs generated by the pegging algorithm
نویسنده
چکیده
We study the connectivity of random d-regular graphs which are recursively generated by an algorithm motivated by a peer to peer network. We show that these graphs are asymptotically almost surely d-connected for any even constant d ≥ 4.
منابع مشابه
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging
The pegging algorithm is a method of generating large random regular graphs beginning with small ones. The ǫ-mixing time of the distribution of short cycle counts of these random regular graphs is the time at which the distribution reaches and maintains total variation distance at most ǫ from its limiting distribution. We show that this ǫ-mixing time is not o(ǫ−1). This demonstrates that the up...
متن کاملShort cycle distribution in random regular graphs recursively generated by pegging
We introduce a new method of generating random d-regular graphs by repeatedly applying an operation called pegging. The pegging operation is abstracted from a type of basic operation applied in a type of peer-to-peer network called the SWAN network. We prove that for the resulting graphs, the limiting joint distribution of the numbers of short cycles is independent Poisson. We also use coupling...
متن کاملRobustness of Random Graphs Based on Natural Connectivity
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the n...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملSystematic generation of very hard cases for graph 3-colorability
We present a simple generation procedure which turns out to be an eeective source of very hard cases for graph 3-colorability. The graphs distributed according to this generation procedure are much denser in very hard cases than previously reported for the same problem size. The coloring cost for these instances is also orders of magnitude bigger. This ability is issued from the fact that the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 65 شماره
صفحات -
تاریخ انتشار 2010